Combined Monte Carlo sampling and penalty method for Stochastic nonlinear complementarity problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combined Monte Carlo sampling and penalty method for Stochastic nonlinear complementarity problems

In this paper, we consider a new formulation with recourse for a class of stochastic nonlinear complementarity problems. We show that the new formulation is equivalent to a smooth semi-infinite program that no longer contains recourse variables. We then propose a combined Monte Carlo sampling and penalty method for solving the problem in which the underlying sample space is assumed to be compac...

متن کامل

Monte Carlo Sampling and Penalty Method for Stochastic Mathematical Programs with Complementarity Constraints and Recourse∗

In this paper, we consider a new formulation for stochastic mathematical programs with complementarity constraints and recourse. We show that the new formulation is equivalent to a smooth semi-infinite program. Then, we propose a Monte Carlo sampling and penalty method for solving the problem. Comprehensive convergence analysis and numerical examples are included as well.

متن کامل

Optimality Conditions and Combined Monte Carlo Sampling and Penalty Method for Stochastic Mathematical Programs with Complementarity Constraints and Recourse∗

In this paper, we consider a new formulation for stochastic mathematical programs with complementarity constraints and recourse. We show that the new formulation is equivalent to a smooth semi-infinite program that does no longer contain recourse variables. Optimality conditions for the problem are deduced and connections among the conditions are investigated. Then, we propose a combined Monte ...

متن کامل

New Reformulations and Smoothed Penalty Method for Stochastic Nonlinear Complementarity Problems

We consider the stochastic nonlinear complementarity problem (SNCP), which has been receiving much attention in the recent optimization world. We first formulate the problem as a stochastic mathematical program with equilibrium constraints (SMPEC) and then, in order to develop some efficient methods, we further give some reformulations of the SNCP. In particular, for the case where the random v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 2009

ISSN: 0025-5718,1088-6842

DOI: 10.1090/s0025-5718-09-02206-6